Probabilistic complexity theory - PDFSEARCH.IO - Document Search Engine

Probabilistic complexity theory
Results: 385

#	Item
61	Noname manuscript No. (will be inserted by the editor) Faster Randomized Consensus With an Oblivious Adversary James Aspnes Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Consensus Randomized algorithm Time complexity SL Iterated logarithm Theoretical computer science Computational complexity theory Applied mathematics
62	Exercise 1 (A streaming algorithm for the second moment of the frequencies). We are given a stream of numbers x1 , . . . , xn ∈ {0, . . . , m − 1} and we want to compute the sum of the squares of the frequencies of Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Probabilistic complexity theory Randomized algorithm Logarithm Applied mathematics Computational complexity theory Errors-in-variables models Normal distribution Theoretical computer science Mathematics Analysis of algorithms
63	Sub-Logarithmic Test-and-Set Against a Weak Adversary? Dan Alistarh1 and James Aspnes2 1 2 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Consensus Algorithm Time complexity Adversary model Logarithm Theoretical computer science Computational complexity theory Applied mathematics
64	Resolving the conflict between generality and plausibility in verified computation Srinath Setty? , Benjamin Braun? , Victor Vu? , Andrew J. Blumberg? , Bryan Parno† , and Michael Walfish? ? The University of Texas at Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-03-10 19:40:43 Probabilistic complexity theory IP Probabilistically checkable proof NP Vector space Soundness MAX-3SAT Algebra Mathematics Theoretical computer science
65	Approximation Algorithms for Unique Games via Orthogonal Separators Lecture notes by Konstantin Makarychev. Lecture notes are based on the papers [CMM06a, CMM06b, LM14]. 1 Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-11-22 21:53:55 Normal distribution Applied mathematics Probability and statistics Statistics Analysis of algorithms Probabilistic complexity theory Randomized algorithm
66	A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-03-12 01:21:32 Complexity classes Cryptography Probabilistic complexity theory Circuit complexity IP Commitment scheme NP Randomized algorithm XTR Theoretical computer science Computational complexity theory Applied mathematics
67	A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2010-07-11 20:15:23 Quantum complexity theory Bounded-error probabilistic polynomial Pseudorandom generator Fourier transform IP FO Theoretical computer science Applied mathematics PP
68	Supplemental Appendix For: A Mixture Model for Middle-category Inflation in Ordered Survey Responses In this appendix, we first present a series of Monte Carlo experiments that compare the performance of our OP, MiOP, an Add to Reading List Source URL: www.bumbamukherjee.com Language: English - Date: 2012-11-11 18:35:07 Physical cosmology Statistical inference Monte Carlo method Numerical analysis Probabilistic complexity theory Economic model Inflation Estimation theory Probability and statistics Applied mathematics Statistics
69	Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139 Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-05-13 09:33:41 Structural complexity theory Complexity classes Models of computation Lance Fortnow Probabilistic complexity theory Interactive proof system IP Bounded-error probabilistic polynomial Probabilistic Turing machine Theoretical computer science Computational complexity theory Applied mathematics

UPDATE